A Self-Deploying Election Service for Active Networks

Active networking aims at minimizing the functionality that is built into a data network. In a bottom{up approach we presume a network void from any functionality and study the problem of deploying and providing a basic, externally deened and non{trivial distributed service. As a test case we use the robust election of a coordinator. Based on the bully algorithm, we implemented an election service that is fully based on active packets. It deploys itself to every reachable active network segment , continuously scans for newly attached nodes and networks and provides a segment wide election service for all attached nodes. Other services e.g., routing, can use this basic coordination functionality to dynamically determine the segment's leader node that will store the routing tables for this segment. The implementation was carried out in the M0 messenger environment and tested in a worldwide active networks testbed. The complete and self{contained initiaìelection service germ' ts in less than 1'200 Bytes and asserts the ubiquitous presence of this service.